GLn-INVARIANT TENSORS AND GRAPHS
نویسندگان
چکیده
We describe a correspondence between GLn-invariant tensors and graphs. We then show how this correspondence accommodates various types of symmetries and orientations.
منابع مشابه
Invariant Tensors and Graphs
We describe a correspondence between GLn-invariant tensors and graphs. We then show how this correspondence accommodates various types of symmetries and orientations.
متن کاملInvariant Polynomials on Tensors Under the Action of a Product of Orthogonal Groups
Invariant Polynomials on Tensors Under the Action of a Product of Orthogonal Groups by Lauren Kelly Williams The University of Wisconsin–Milwaukee, 2013 Under the Supervision of Professor Jeb F. Willenbring Let K be the product On1×On2×· · ·×Onr of orthogonal groups. Let V = ⊗i=1C , the r-fold tensor product of defining representations of each orthogonal factor. We compute a stable formula for ...
متن کاملParsing Noisy Recursively-Structured Geometric Patterns
This paper describes a method for affine-invariant syntactic pattern recognition of geometric patterns using a new type of context-free graph grammar. The grammar accommodates variability in the geometric relations between parts of patterns; this variability is modelled using affine transformations and metric tensors. A parallel parsing algorithm is outlined, which is suitable for non-Eulerian ...
متن کاملEncoding !-tensors as !-graphs with neighbourhood orders
Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to mark repeated structure inside a diagram. This led to !-graphs being implemented in the diagrammatic proof assistant Quantomatic. Having a partially automate...
متن کاملMultilinear Low-Rank Tensors on Graphs & Applications
We propose a new framework for the analysis of lowrank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank SVD for matrices and multilinear SVD for tensors. Then, building on this novel decomposition we construct a general class of convex optimization...
متن کامل